Evolving Hyper-Heuristics for a Highly Constrained Examination Timetabling Problem
نویسنده
چکیده
A lot of research has been conducted on hyper-heuristics for examination timetabling. However, most of this work has been focused on an uncapacitated version of the problem. This study reports on evolving hyper-heuristics for a highly constrained version of the problem, namely, the set of problems from the second International Timetabling Competition (ITC ’07). Previous work has shown that using an evolutionary algorithm (EA) based hyper-heuristic with more than one chromosome representation is more effective than the standard EA using a single representation. This study evaluates an EA hyper-heuristic, using three different chromosome representations, in solving the capacitated examination timetabling problem. The results produced by the hyper-heuristic were found to be comparable to other methodologies applied to the same problem set.
منابع مشابه
Evolving timetabling heuristics using a grammar-based genetic programming hyper-heuristic framework
This paper introduces a Grammar-based Genetic Programming Hyper-Heuristic framework (GPHH) for evolving constructive heuristics for timetabling. In this application GP is used as an online learning method which evolves heuristics while solving the problem. In other words, the system keeps on evolving heuristics for a problem instance until a good solution is found. The framework is tested on so...
متن کاملPerturbation based variable neighbourhood search in heuristic space for examination timetabling problem
Efficient constructive heuristics have been designed for most of the difficult combinatorial optimisation problems. Performance of these heuristics may vary from one instance to another and hence it is beneficial to be able to select an instance of the heuristic which is best suited to a given instance of the problem. Both of the heuristic search algorithm and hyper-heuristic approaches try to ...
متن کاملHyper heuristic based on great deluge and its variants for exam timetabling problem
Today, University Timetabling problems are occurred annually and they are often hard and time consuming to solve. This paper describes Hyper Heuristics (HH) method based on Great Deluge (GD) and its variants for solving large, highly constrained timetabling problems from different domains. Generally, in hyper heuristic framework, there are two main stages: heuristic selection and move acceptanc...
متن کاملHybrid artificial intelligence technique for solving large, highly constrained timetabling problems
Timetabling problems are often hard and time-consuming to solve. Profits from full automatization of this process can be invaluable. Although over the years many solutions have been proposed, most of the methods concern only one problem instance or class. This paper describes a possibly universal method for solving large, highly constrained timetabling problems from different areas. The solutio...
متن کاملAnalysing the High Level Heuristics within a Graph Based Hyper-heuristic
This paper presents our work on analysing high level heuristics within a graph based hyper-heuristic framework. Local search based methods (Tabu Search and steepest descent method) are compared as the high level heuristics within the graph based hyper-heuristic framework and the analysis of their neighborhood structures and performance on the high level landscape is carried out. An iterated ste...
متن کامل